Comparing of Routine Nano-particles for Creating Pattern Using Genetic Algorithm and Particle Swarm Optimization - Ant System in Simulation using Atomic Force Microscopy

نویسندگان

  • Ahmad Naebi
  • Moharam H. Korayem
  • Aghil E. Kelishomi
  • Iman Rezazadeh
چکیده

Pattern creating with nano-particle is one of the best application methods in nano-scale that it will be used for new pattern creating and make micro/nano-electromechanical System (MEMS/NEMS) in future. Particle swarm optimization algorithm is one of evolutionary computation techniques and the optimization method based on population and ant algorithm, optimization algorithm is modeled based on ants. In addition explained algorithms, the genetic algorithm is adaptive methods that use to optimizing of problem. In this paper, we have created modified and combined of particle swarm optimization and genetic algorithm. Also this method has been implemented using modified in genetic algorithm. In other words, proposed algorithms have been implemented with modified in their structures and considering applied condition for creating of pattern with nano-particles. Dynamic modeling and simulation for manipulating of cantilever and probe in the liquid and vacuum environment in Mathimatica Software done. Routing of algorithms implemented in Matlab Software. The functionality of the method are: Firstly, the result is minimum of time and energy in moving of cantilever. In fact we can find the minimum of routing. Secondly, during the transport of nano-particles mustn’t occur any collision, because in this case the atomic force microscope has to scan the surface again, and it will take more time. So we will get the minimum time for creating of the special pattern without any collision using the proposed algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulation of Routing in Nano-Manipulation for Creating Pattern with Atomic Force Microscopy Using Hybrid GA and PSO-AS Algorithms

Avoiding collision of nano-particles during manipulation operations and selecting the best route and lowest Atomic Force Microscopy (AFM) movement are major concerns in the area of nano-space. To apply the lowest force on the cantilever from fluid environment forces, we try to minimize AFM movements. Our proposed method calculates the optimum routing for AFM probe movement for nano-particles tr...

متن کامل

Optimal Placement of Remote Control Switches in Radial Distribution Network for Reliability Improvement using Particle Swarm Optimization with Sine Cosine Acceleration Coefficients

Abstract: One of the equipment that can help improve distribution system status today and reduce the cost of fault time is remote control switches (RCS). Finding the optimal location and number of these switches in the distribution system can be modeled with various objective functions as a nonlinear optimization problem to improve system reliability and cost. In this article, a particle swarm ...

متن کامل

Frequency Control of Isolated Hybrid Power Network Using Genetic Algorithm and Particle Swarm Optimization

This paper, presents a suitable control system to manage energy in distributed power generation system with a Battery Energy Storage Station and fuel cell. First, proper Dynamic Shape Modeling is prepared. Second, control system is proposed which is based on Classic Controller. This model is educated with Genetic Algorithm and particle swarm optimization. The proposed strategy is compared with ...

متن کامل

Development of PSPO Simulation Optimization Algorithm

In this article a new algorithm is developed for optimizing computationally expensive simulation models. The optimization algorithm is developed for continues unconstrained single output simulation models. The algorithm is developed using two simulation optimization routines. We employed the nested partitioning (NP) routine for concentrating the search efforts in the regions which are most like...

متن کامل

Adaptive Rule-Base Influence Function Mechanism for Cultural Algorithm

This study proposes a modified version of cultural algorithms (CAs) which benefits from rule-based system for influence function. This rule-based system selects and applies the suitable knowledge source according to the distribution of the solutions. This is important to use appropriate influence function to apply to a specific individual, regarding to its role in the search process. This rule ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014